Use of Particle Swarm Optimization to Design Combinational Logic Circuits
نویسندگان
چکیده
This paper presents a proposal based on binary particle swarm optimization to design combinational logic circuits at the gate-level. The algorithm is validated using several examples from the literature, and is compared against a genetic algorithm (with integer representation), and against human designers who used traditional circuit design aids (e.g., Karnaugh Maps). Results indicate that particle swarm optimization may be a viable alternative to design combinational circuits at the gate-level.
منابع مشابه
Reusing Code in Genetic Programming
In this paper we propose an approach to Genetic Programming based on code reuse and we test it in the design of combinational logic circuits at the gate-level. The circuits evolved by our algorithm are compared with circuits produced by human designers, by Particle Swarm Optimization, by an n-cardinality GA and by Cartesian Genetic Programming.
متن کاملAn Optimal Partitioning Algorithm for Combinational CMOS Circuits Using Particle Swarm Optimization
This paper presents a swarm intelligence based approach to optimally partition combinational CMOS circuits for pseudoexhaustive testing. The partitioning algorithm ensures reduction in the number of test vectors required to detect faults in VLSI circuits. The algorithm is based on the circuit’s primary input cone (N) and fanout (F) values to decide the location and number of partitions. Particl...
متن کاملComputational Intelligence in Circuit Synthesis
This paper is devoted to the synthesis of combinational logic circuits through computational intelligence or, more precisely, using evolutionary computation techniques. Are studied two evolutionary algorithms, the Genetic and the Memetic Algorithm (GAs, MAs) and one swarm intelligence algorithm, the Particle Swarm Optimization (PSO). GAs are optimization and search techniques based on the princ...
متن کاملParticle swarm-based optimal partitioning algorithm for combinational CMOS circuits
This paper presents a swarm intelligence based approach to optimally partition combinational CMOS circuits for pseudoexhaustive testing. The partitioning algorithm ensures reduction in the number of test vectors required to detect faults in VLSI circuits. The algorithm is based on the circuit’s maximum primary input cone size (N) and minimum fanout (F) values to decide the location and number o...
متن کاملBinary particle swarm optimization (BPSO) based state assignment for area minimization of sequential circuits
State assignment (SA) for finite state machines (FSMs) is one of the main optimization problems in the synthesis of sequential circuits. It determines the complexity of its combinational circuit and thus area, delay, testability and power dissipation of its implementation. Particle swarm optimization (PSO) is a nondeterministic heuristic that optimizes a problem by iteratively trying to improve...
متن کامل